基于凸闭包集的不规则三角网算法研究与实现

不规则三角网是影响土石方量计算的关键问题之一，虽然目前已有大量研究人员对Delaunay三角网进行优化，但仍然缺少对三角网生成速率和计算精度的综合研究。针对此问题，基于VB.NET平台的点、边以及三角形的结构化数据结构设计快速生成凸闭包集形成Delaunay三角网，通过四边形空圆特性以及对角线最短原则对构网结果进行检验和优化。试验计算表明，该算法的计算结果与经典DTM法、方格网法的土方量计算相对误差均在0.30%以内。该方法不仅具有较高的组网效率，并能保持较好的计算精度。     

基于最小包容区域的球度误差评定方法

针对球度误差评定方法存在原理误差或模型误差,提出了一种符合最小包容区域定义的球度误差评定方法,即将几何搜索逼近算法与基于最小包容区域法的球度误差评定的几何结构和定义结合起来的准确评定方法。对仿真数据和其他文献中的数据进行了评定。所提方法与其他方法的评定结果表明,所提方法可以准确地找到最小包容区域球的球心并给出球度误差的精确解。     

改进ILoG算子的故障检测方法

针对强背景噪声干扰下轮对轴承故障特征微弱、难以准确检测的问题,提出了一种自适应改进高斯拉普拉斯(improved Laplacian of Gaussian,简称ILoG)算子的微弱故障检测方法。ILoG算子滤波器具有优良的信号突变特征检测能力,将其用于轮对轴承故障信号的冲击特征检测,同时利用水循环算法(water cycle algorithm,简称WCA)的寻优特性,并行搜寻筛选最佳的ILoG算子影响参数,通过对参数优化后ILoG算子滤波后信号做进一步包络解调分析,提取出轮对轴承微弱的故障特征信息。对实际轮对轴承外圈和内圈故障信号分析的结果表明,该方法可以有效检测出轴承微弱故障特征频率,故障检测效果优于小波阈值和多尺度形态学差值滤波方法。     

单线激光雷达与GNSS/INS的空间重构

为了解决多线激光雷达在三维空间重构任务中数据吞吐量过大导致运算负担过重以及扫描俯仰范围有限的问题,本文提出了一种利用单线激光雷达与惯性测量单元GNSS/INS相互结合的多站点扫描空间重构方案及相应解算方法。首先使用单线激光雷达扫描待测空间获取三维尺度信息,然后将点云数据与对应的任意方向的航向角相结合,再利用四元数姿态解算获取各站点扫描的点云图像。为提高计算效率,使用迭代最近点算法实现站点间点云配准时,对待匹配点云数据筛选并更新。实验结果表明在保留点云数字特征前提下,单线激光雷达与GNSS/INS系统能够提高76%的运算速率。本文提出的硬件方案和解算方法不但能够实现较高的配准精度,与多线激光雷达方案相比工程成本也得到显著下降。     

Neural network-based hybrid models developed for free radical polymerization of styrene

In the present work, the free radical polymerization of styrene is modeled by considering the phenomenology of the process (a simplified model, which does not include the diffusional effects, gel, and glass effects) in combination with an empirical model represented by an artificial neural network. Differential evolution (DE) algorithm, belonging to the class of evolutionary algorithms, is applied for developing the neural models in optimal forms. For improving the results—predicted conversion and molecular weights as function of time, temperature, and initiator concentration—different combinations between phenomenological model and neural network are tested; also, individual and stacked neural networks have been developed for the polymerization process. This methodology based on hybrid models, including neural networks aggregated in stacks, provides accurate results.     

A novel strategy based on salp swarm algorithm for extracting the maximum power of proton exchange membrane fuel cell

Cell temperature and water content of the membrane have a significant effect on the performance of fuel cells. The current-power curve of the fuel cell has a maximum power point (MPP) that is needed to be tracked. This study presents a novel strategy based on a salp swarm algorithm (SSA) for extracting the maximum power of proton-exchange membrane fuel cell (PEMFC). At first, a new formula is derived to estimate the optimal voltage of PEMFC corresponding to MPP. Then the error between the estimated voltage at MPP and the actual terminal voltage of the fuel cell is fed to a proportional-integral-derivative controller (PID). The output of the PID controller tunes the duty cycle of a boost converter to maximize the harvested power from the PEMFC. SSA determines the optimal gains of PID. Sensitivity analysis is performed with the operating fuel cell at different cell temperature and water content of the membrane. The obtained results through the proposed strategy are compared with other programmed approaches of incremental resistance method, Fuzzy-Logic, grey antlion optimizer, wolf optimizer, and mine-blast algorithm. The obtained results demonstrated high reliability and efficiency of the proposed strategy in extracting the maximum power of the PEMFC.     

基于第三方物流的家具配送开放式车辆路径问题

为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本.     

Optimal design of nonlinear model predictive controller based on new modified multitracker optimization algorithm

The controller design for the robotic manipulator faces different challenges such as the system's nonlinearities and the uncertainties of the parameters. Furthermore, the tracking of different linear and nonlinear trajectories represents a vital role by the manipulator. This paper suggests an optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA). The proposed modification of the MTOA is carried out based on opposition-based learning (OBL) and quasi OBL approaches. This modification improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum. The proposed method is applied on the robotic manipulator to track different linear and nonlinear trajectories. The NLMPC parameters are tuned by the MMTOA rather than the trial and error method of the designer. The proposed NLMPC based on MMTOA is compared with the original MTOA, genetic algorithm, and cuckoo search algorithm in literature. The superiority and effectiveness of the proposed controller are confirmed to track different linear and nonlinear trajectories. Furthermore, the robustness of the proposed method is emphasized against the uncertainties of the parameters.     

Disassembly sequence planning using a Flatworm algorithm

Disassembly Sequence Planning (DSP) refers to a disassembly sequence based on the disassembly properties and restrictions of the product parts that meets the benefit goal. This study aims to reduce the number of changes in disassembly direction and disassembly tools so as to reduce the disassembly time. This study proposes a novel Flatworm algorithm that evolves through the regenerative properties of the flatworm. It is similar to the evolutionary concept of genetic algorithms, with evolution as the main idea, but without crossover, mutation or replication mechanisms in the evolutionary processes. Instead, it is based upon the characteristics of the growth, fracture and regeneration mechanisms of the flatworm. The Flatworm algorithm features a variety of disassembly combinations and excellent mechanisms to avoid the local optimal solution. In particular, it has the advantage of keeping a good disassembly combination from being destroyed. In this study, it is compared with two genetic algorithms and two ant colony algorithms and tested in three examples of different complexity: a ceiling fan, a printer, and 150 simulated parts. The solution searching ability and execution time are compared upon the same evaluation standard. The test results demonstrate that the novel Flatworm algorithm proposed in this study is superior to the two genetic algorithms and ant colony algorithms in solution quality.